An independent dominating set in the complement of a minimum dominating set of a tree
نویسندگان
چکیده
منابع مشابه
An independent dominating set in the complement of a minimum dominating set of a tree
We prove that for every tree T of order at least 2 and every minimum dominating set D of T which contains at most one endvertex of T , there is an independent dominating set I of T which is disjoint from D. This confirms a recent conjecture of Johnson, Prier, and Walsh.
متن کاملFinding a minimum independent dominating set in a permutation graph
We give an 0 (nlogln) [ime algorirnm for finding a minimum independem dominating se[ in a pennmation graph. TItis improves on ilie previous D(n 3) time algorictun known for solving tllis problem [4]. .,. Dept of CompUlcr Sci., Purdue Univ., West Gf:tyelle, IN 47907. Rcso::trch ~upported by ONR. Contr:lct NOOOI-l-34-K. 0502:md NSF Gl':tnl DCR-8451393, wilh matching funds from AT&T. • o.:pt of Ma...
متن کاملMinimal Spanning Tree From a Minimum Dominating Set
In this article, we provide a constructive procedure to generate a spanning tree for any graph from its dominating set, γ set. We introduce a new kind of minimum dominating set and hence generate a minimum weighted spanning tree from a γ set for G. We also provide a method for generating a minimum weighted spanning tree using adjacency matrix of G. Key–Words: Spanning tree, Minimum dominating s...
متن کاملOn graphs having a unique minimum independent dominating set
In this paper, we consider graphs having a unique minimum independent dominating set. We first discuss the effects of deleting a vertex, or the closed neighborhood of a vertex, from such graphs. We then discuss five operations which, in certain circumstances, can be used to combine two graphs, each having a unique minimum independent dominating set, to produce a new graph also having a unique m...
متن کاملApproximating the Minimum Independent Dominating Set in Perturbed Graphs
We investigate the minimum independent dominating set in perturbed graphs g(G, p) of input graph G = (V,E), obtained by negating the existence of edges independently with a probability p > 0. The minimum independent dominating set (MIDS) problem does not admit a polynomial running time approximation algorithm with worst-case performance ratio of n1− for any > 0. We prove that the size of the mi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied Mathematics Letters
سال: 2010
ISSN: 0893-9659
DOI: 10.1016/j.aml.2009.08.008